<!DOCTYPE html><html lang="en" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width, initial-scale=1.0,viewport-fit=cover"><title>数据结构部分 | CanJisam的博客</title><meta name="author" content="CanJisam"><meta name="copyright" content="CanJisam"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta name="description" content="数据结构部分线性数据结构数组(Array) 定义：连续内存空间存储同类型数据 特点：随机访问，固定大小 操作：插入、删除、查找、遍历、排序  链表(Linked List) 单向链表：每个节点存储数据和后继指针 双向链表：每个节点存储数据和前驱、后继指针 循环链表：尾节点指向头节点 操作：插入、删除、查找、遍历、排序  栈(Stack) 定义：后进先出(LIFO)的线性表 操作：压栈(push)、">
<meta property="og:type" content="article">
<meta property="og:title" content="数据结构部分">
<meta property="og:url" content="https://canjisam.github.io/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86/index.html">
<meta property="og:site_name" content="CanJisam的博客">
<meta property="og:description" content="数据结构部分线性数据结构数组(Array) 定义：连续内存空间存储同类型数据 特点：随机访问，固定大小 操作：插入、删除、查找、遍历、排序  链表(Linked List) 单向链表：每个节点存储数据和后继指针 双向链表：每个节点存储数据和前驱、后继指针 循环链表：尾节点指向头节点 操作：插入、删除、查找、遍历、排序  栈(Stack) 定义：后进先出(LIFO)的线性表 操作：压栈(push)、">
<meta property="og:locale" content="en_US">
<meta property="og:image" content="https://canjisam.github.io/img/butterfly-icon.png">
<meta property="article:published_time" content="2025-03-09T19:14:13.000Z">
<meta property="article:modified_time" content="2025-03-09T19:49:52.236Z">
<meta property="article:author" content="CanJisam">
<meta property="article:tag" content="数据结构">
<meta property="article:tag" content="编程">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="https://canjisam.github.io/img/butterfly-icon.png"><script type="application/ld+json">{
  "@context": "https://schema.org",
  "@type": "BlogPosting",
  "headline": "数据结构部分",
  "url": "https://canjisam.github.io/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86/",
  "image": "https://canjisam.github.io/img/butterfly-icon.png",
  "datePublished": "2025-03-09T19:14:13.000Z",
  "dateModified": "2025-03-09T19:49:52.236Z",
  "author": [
    {
      "@type": "Person",
      "name": "CanJisam",
      "url": "https://canjisam.github.io/"
    }
  ]
}</script><link rel="shortcut icon" href="/img/favicon.png"><link rel="canonical" href="https://canjisam.github.io/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86/index.html"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css"><script>
    (() => {
      
    const saveToLocal = {
      set: (key, value, ttl) => {
        if (!ttl) return
        const expiry = Date.now() + ttl * 86400000
        localStorage.setItem(key, JSON.stringify({ value, expiry }))
      },
      get: key => {
        const itemStr = localStorage.getItem(key)
        if (!itemStr) return undefined
        const { value, expiry } = JSON.parse(itemStr)
        if (Date.now() > expiry) {
          localStorage.removeItem(key)
          return undefined
        }
        return value
      }
    }

    window.btf = {
      saveToLocal,
      getScript: (url, attr = {}) => new Promise((resolve, reject) => {
        const script = document.createElement('script')
        script.src = url
        script.async = true
        Object.entries(attr).forEach(([key, val]) => script.setAttribute(key, val))
        script.onload = script.onreadystatechange = () => {
          if (!script.readyState || /loaded|complete/.test(script.readyState)) resolve()
        }
        script.onerror = reject
        document.head.appendChild(script)
      }),
      getCSS: (url, id) => new Promise((resolve, reject) => {
        const link = document.createElement('link')
        link.rel = 'stylesheet'
        link.href = url
        if (id) link.id = id
        link.onload = link.onreadystatechange = () => {
          if (!link.readyState || /loaded|complete/.test(link.readyState)) resolve()
        }
        link.onerror = reject
        document.head.appendChild(link)
      }),
      addGlobalFn: (key, fn, name = false, parent = window) => {
        if (!false && key.startsWith('pjax')) return
        const globalFn = parent.globalFn || {}
        globalFn[key] = globalFn[key] || {}
        globalFn[key][name || Object.keys(globalFn[key]).length] = fn
        parent.globalFn = globalFn
      }
    }
  
      
      const activateDarkMode = () => {
        document.documentElement.setAttribute('data-theme', 'dark')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#0d0d0d')
        }
      }
      const activateLightMode = () => {
        document.documentElement.setAttribute('data-theme', 'light')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#ffffff')
        }
      }

      btf.activateDarkMode = activateDarkMode
      btf.activateLightMode = activateLightMode

      const theme = saveToLocal.get('theme')
    
          theme === 'dark' ? activateDarkMode() : theme === 'light' ? activateLightMode() : null
        
      
      const asideStatus = saveToLocal.get('aside-status')
      if (asideStatus !== undefined) {
        document.documentElement.classList.toggle('hide-aside', asideStatus === 'hide')
      }
    
      
    const detectApple = () => {
      if (/iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)) {
        document.documentElement.classList.add('apple')
      }
    }
    detectApple()
  
    })()
  </script><script>const GLOBAL_CONFIG = {
  root: '/',
  algolia: undefined,
  localSearch: undefined,
  translate: undefined,
  highlight: {"plugin":"highlight.js","highlightCopy":true,"highlightLang":true,"highlightHeightLimit":false,"highlightFullpage":false,"highlightMacStyle":false},
  copy: {
    success: 'Copy Successful',
    error: 'Copy Failed',
    noSupport: 'Browser Not Supported'
  },
  relativeDate: {
    homepage: false,
    post: false
  },
  runtime: '',
  dateSuffix: {
    just: 'Just now',
    min: 'minutes ago',
    hour: 'hours ago',
    day: 'days ago',
    month: 'months ago'
  },
  copyright: undefined,
  lightbox: 'null',
  Snackbar: undefined,
  infinitegrid: {
    js: 'https://cdn.jsdelivr.net/npm/@egjs/infinitegrid/dist/infinitegrid.min.js',
    buttonText: 'Load More'
  },
  isPhotoFigcaption: false,
  islazyloadPlugin: false,
  isAnchor: false,
  percent: {
    toc: true,
    rightside: false,
  },
  autoDarkmode: false
}</script><script id="config-diff">var GLOBAL_CONFIG_SITE = {
  title: '数据结构部分',
  isHighlightShrink: false,
  isToc: true,
  pageType: 'post'
}</script><meta name="generator" content="Hexo 7.3.0"></head><body><div class="post" id="body-wrap"><header class="post-bg" id="page-header"><nav id="nav"><span id="blog-info"><a class="nav-site-title" href="/"><span class="site-name">CanJisam的博客</span></a><a class="nav-page-title" href="/"><span class="site-name">数据结构部分</span></a></span><div id="menus"></div></nav><div id="post-info"><h1 class="post-title">数据结构部分</h1><div id="post-meta"><div class="meta-firstline"><span class="post-meta-date"><i class="far fa-calendar-alt fa-fw post-meta-icon"></i><span class="post-meta-label">Created</span><time class="post-meta-date-created" datetime="2025-03-09T19:14:13.000Z" title="Created 2025-03-10 03:14:13">2025-03-10</time><span class="post-meta-separator">|</span><i class="fas fa-history fa-fw post-meta-icon"></i><span class="post-meta-label">Updated</span><time class="post-meta-date-updated" datetime="2025-03-09T19:49:52.236Z" title="Updated 2025-03-10 03:49:52">2025-03-10</time></span><span class="post-meta-categories"><span class="post-meta-separator">|</span><i class="fas fa-inbox fa-fw post-meta-icon"></i><a class="post-meta-categories" href="/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">数据结构</a></span></div><div class="meta-secondline"><span class="post-meta-separator">|</span><span class="post-meta-pv-cv" id="" data-flag-title=""><i class="far fa-eye fa-fw post-meta-icon"></i><span class="post-meta-label">Post Views:</span><span id="busuanzi_value_page_pv"><i class="fa-solid fa-spinner fa-spin"></i></span></span></div></div></div></header><main class="layout" id="content-inner"><div id="post"><article class="container post-content" id="article-container"><h1 id="数据结构部分"><a href="#数据结构部分" class="headerlink" title="数据结构部分"></a>数据结构部分</h1><h2 id="线性数据结构"><a href="#线性数据结构" class="headerlink" title="线性数据结构"></a>线性数据结构</h2><h3 id="数组-Array"><a href="#数组-Array" class="headerlink" title="数组(Array)"></a>数组(Array)</h3><ul>
<li>定义：连续内存空间存储同类型数据</li>
<li>特点：随机访问，固定大小</li>
<li>操作：插入、删除、查找、遍历、排序</li>
</ul>
<h3 id="链表-Linked-List"><a href="#链表-Linked-List" class="headerlink" title="链表(Linked List)"></a>链表(Linked List)</h3><ul>
<li>单向链表：每个节点存储数据和后继指针</li>
<li>双向链表：每个节点存储数据和前驱、后继指针</li>
<li>循环链表：尾节点指向头节点</li>
<li>操作：插入、删除、查找、遍历、排序</li>
</ul>
<h3 id="栈-Stack"><a href="#栈-Stack" class="headerlink" title="栈(Stack)"></a>栈(Stack)</h3><ul>
<li>定义：后进先出(LIFO)的线性表</li>
<li>操作：压栈(push)、出栈(pop)、获取栈顶(top)</li>
<li>应用：函数调用、表达式求值、括号匹配</li>
</ul>
<h3 id="队列-Queue"><a href="#队列-Queue" class="headerlink" title="队列(Queue)"></a>队列(Queue)</h3><ul>
<li>定义：先进先出(FIFO)的线性表</li>
<li>类型：普通队列、循环队列、双端队列</li>
<li>操作：入队(enqueue)、出队(dequeue)</li>
<li>应用：任务调度、缓冲区管理</li>
</ul>
<h2 id="非线性数据结构"><a href="#非线性数据结构" class="headerlink" title="非线性数据结构"></a>非线性数据结构</h2><h3 id="树-Tree"><a href="#树-Tree" class="headerlink" title="树(Tree)"></a>树(Tree)</h3><h4 id="二叉树-Binary-Tree"><a href="#二叉树-Binary-Tree" class="headerlink" title="二叉树(Binary Tree)"></a>二叉树(Binary Tree)</h4><ul>
<li>完全二叉树</li>
<li>满二叉树</li>
<li>遍历：前序、中序、后序、层序</li>
</ul>
<h4 id="二叉搜索树-BST"><a href="#二叉搜索树-BST" class="headerlink" title="二叉搜索树(BST)"></a>二叉搜索树(BST)</h4><ul>
<li>定义：左子树小于根节点，右子树大于根节点</li>
<li>操作：插入、删除、查找</li>
<li>平均时间复杂度：O(log n)</li>
</ul>
<h4 id="平衡二叉树-AVL-Tree"><a href="#平衡二叉树-AVL-Tree" class="headerlink" title="平衡二叉树(AVL Tree)"></a>平衡二叉树(AVL Tree)</h4><ul>
<li>定义：任意节点的左右子树高度差不超过1</li>
<li>操作：左旋、右旋、插入、删除</li>
</ul>
<h4 id="红黑树-Red-Black-Tree"><a href="#红黑树-Red-Black-Tree" class="headerlink" title="红黑树(Red-Black Tree)"></a>红黑树(Red-Black Tree)</h4><ul>
<li>特点：自平衡的二叉搜索树</li>
<li>性质：根黑、叶黑、红子黑、黑高相等</li>
<li>应用：STL容器实现</li>
</ul>
<h4 id="字典树-Trie"><a href="#字典树-Trie" class="headerlink" title="字典树(Trie)"></a>字典树(Trie)</h4><ul>
<li>特点：用于存储和检索字符串</li>
<li>应用：前缀匹配、自动补全</li>
</ul>
<h4 id="哈夫曼树-Huffman-Tree"><a href="#哈夫曼树-Huffman-Tree" class="headerlink" title="哈夫曼树(Huffman Tree)"></a>哈夫曼树(Huffman Tree)</h4><ul>
<li>特点：带权路径长度最小的二叉树</li>
<li>应用：数据压缩</li>
</ul>
<h3 id="图-Graph"><a href="#图-Graph" class="headerlink" title="图(Graph)"></a>图(Graph)</h3><ul>
<li>表示：邻接矩阵、邻接表</li>
<li>类型：有向图、无向图、带权图</li>
<li>遍历：深度优先(DFS)、广度优先(BFS)</li>
<li>算法：最短路径、最小生成树</li>
</ul>
<h3 id="堆-Heap"><a href="#堆-Heap" class="headerlink" title="堆(Heap)"></a>堆(Heap)</h3><ul>
<li>类型：最大堆、最小堆</li>
<li>特点：完全二叉树</li>
<li>操作：插入、删除最值、建堆</li>
<li>应用：优先队列、堆排序</li>
</ul>
<h3 id="哈希表-Hash-Table"><a href="#哈希表-Hash-Table" class="headerlink" title="哈希表(Hash Table)"></a>哈希表(Hash Table)</h3><ul>
<li>定义：通过哈希函数将键映射到数组</li>
<li>冲突解决：链地址法、开放地址法</li>
<li>应用：快速查找、缓存系统</li>
</ul>
</article><div class="post-copyright"><div class="post-copyright__author"><span class="post-copyright-meta"><i class="fas fa-circle-user fa-fw"></i>Author: </span><span class="post-copyright-info"><a href="https://canjisam.github.io">CanJisam</a></span></div><div class="post-copyright__type"><span class="post-copyright-meta"><i class="fas fa-square-arrow-up-right fa-fw"></i>Link: </span><span class="post-copyright-info"><a href="https://canjisam.github.io/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86/">https://canjisam.github.io/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86/</a></span></div><div class="post-copyright__notice"><span class="post-copyright-meta"><i class="fas fa-circle-exclamation fa-fw"></i>Copyright Notice: </span><span class="post-copyright-info">All articles on this blog are licensed under <a target="_blank" rel="noopener" href="https://creativecommons.org/licenses/by-nc-sa/4.0/">CC BY-NC-SA 4.0</a> unless otherwise stated.</span></div></div><div class="tag_share"><div class="post-meta__tag-list"><a class="post-meta__tags" href="/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">数据结构</a><a class="post-meta__tags" href="/tags/%E7%BC%96%E7%A8%8B/">编程</a></div><div class="post-share"><div class="social-share" data-image="/img/butterfly-icon.png" data-sites="facebook,twitter,wechat,weibo,qq"></div><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/butterfly-extsrc/sharejs/dist/css/share.min.css" media="print" onload="this.media='all'"><script src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/sharejs/dist/js/social-share.min.js" defer></script></div></div><nav class="pagination-post" id="pagination"><a class="pagination-related" href="/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%BC%96%E7%A8%8B/" title="数据结构与编程"><div class="cover" style="background: var(--default-bg-color)"></div><div class="info"><div class="info-1"><div class="info-item-1">Previous</div><div class="info-item-2">数据结构与编程</div></div><div class="info-2"><div class="info-item-1">今天是2023年3月10日，我是一名软件专业的学生，正在学习数据结构与算法。数据结构是计算机科学中非常重要的一个分支，它研究的是数据的组织和存储方式，以及如何对数据进行操作和访问。算法是计算机科学中非常重要的一个分支，它研究的是如何解决问题的方法和步骤。目前的学习目标是：蓝桥杯国奖 </div></div></div></a><a class="pagination-related" href="/2025/03/15/Java%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%AE%9E%E7%8E%B0%E8%AF%A6%E8%A7%A3/" title="Java数据结构实现详解"><div class="cover" style="background: var(--default-bg-color)"></div><div class="info text-right"><div class="info-1"><div class="info-item-1">Next</div><div class="info-item-2">Java数据结构实现详解</div></div><div class="info-2"><div class="info-item-1">Java数据结构实现详解本文详细介绍了各种基本数据结构的Java实现，包括线性数据结构和非线性数据结构。每种数据结构都包含了基本操作方法、时间复杂度分析以及使用示例，可以作为学习数据结构与算法的参考资料。 一、线性数据结构线性数据结构是一种数据元素之间存在一对一关系的数据结构，元素按照线性顺序排列。 1. 数组 (Array)数组是最基本的数据结构，它在内存中是连续存储的，可以通过索引快速访问元素。 特点：  固定大小（静态数组）或可动态调整大小（动态数组） 随机访问元素的时间复杂度为 O(1) 在数组中间插入或删除元素的时间复杂度为 O(n)  主要操作及时间复杂度：  访问元素：O(1) 在末尾添加&#x2F;删除元素：O(1) 均摊 在中间添加&#x2F;删除元素：O(n) 查找元素：O(n)  2. 链表...</div></div></div></a></nav><div class="relatedPosts"><div class="headline"><i class="fas fa-thumbs-up fa-fw"></i><span>Related Articles</span></div><div class="relatedPosts-list"><a class="pagination-related" href="/2025/03/15/Java%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%AE%9E%E7%8E%B0%E8%AF%A6%E8%A7%A3/" title="Java数据结构实现详解"><div class="cover" style="background: var(--default-bg-color)"></div><div class="info text-center"><div class="info-1"><div class="info-item-1"><i class="far fa-calendar-alt fa-fw"></i> 2025-03-15</div><div class="info-item-2">Java数据结构实现详解</div></div><div class="info-2"><div class="info-item-1">Java数据结构实现详解本文详细介绍了各种基本数据结构的Java实现，包括线性数据结构和非线性数据结构。每种数据结构都包含了基本操作方法、时间复杂度分析以及使用示例，可以作为学习数据结构与算法的参考资料。 一、线性数据结构线性数据结构是一种数据元素之间存在一对一关系的数据结构，元素按照线性顺序排列。 1. 数组 (Array)数组是最基本的数据结构，它在内存中是连续存储的，可以通过索引快速访问元素。 特点：  固定大小（静态数组）或可动态调整大小（动态数组） 随机访问元素的时间复杂度为 O(1) 在数组中间插入或删除元素的时间复杂度为 O(n)  主要操作及时间复杂度：  访问元素：O(1) 在末尾添加&#x2F;删除元素：O(1) 均摊 在中间添加&#x2F;删除元素：O(n) 查找元素：O(n)  2. 链表...</div></div></div></a></div></div></div><div class="aside-content" id="aside-content"><div class="card-widget card-info text-center"><div class="avatar-img"><img src="/img/butterfly-icon.png" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"/></div><div class="author-info-name">CanJisam</div><div class="author-info-description"></div><div class="site-data"><a href="/archives/"><div class="headline">Articles</div><div class="length-num">5</div></a><a href="/tags/"><div class="headline">Tags</div><div class="length-num">7</div></a><a href="/categories/"><div class="headline">Categories</div><div class="length-num">2</div></a></div><a id="card-info-btn" target="_blank" rel="noopener" href="https://github.com/xxxxxx"><i class="fab fa-github"></i><span>Follow Me</span></a></div><div class="card-widget card-announcement"><div class="item-headline"><i class="fas fa-bullhorn fa-shake"></i><span>Announcement</span></div><div class="announcement_content">This is my Blog</div></div><div class="sticky_layout"><div class="card-widget" id="card-toc"><div class="item-headline"><i class="fas fa-stream"></i><span>Contents</span><span class="toc-percentage"></span></div><div class="toc-content"><ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86"><span class="toc-number">1.</span> <span class="toc-text">数据结构部分</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BA%BF%E6%80%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84"><span class="toc-number">1.1.</span> <span class="toc-text">线性数据结构</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E7%BB%84-Array"><span class="toc-number">1.1.1.</span> <span class="toc-text">数组(Array)</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%93%BE%E8%A1%A8-Linked-List"><span class="toc-number">1.1.2.</span> <span class="toc-text">链表(Linked List)</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%A0%88-Stack"><span class="toc-number">1.1.3.</span> <span class="toc-text">栈(Stack)</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%98%9F%E5%88%97-Queue"><span class="toc-number">1.1.4.</span> <span class="toc-text">队列(Queue)</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%9D%9E%E7%BA%BF%E6%80%A7%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84"><span class="toc-number">1.2.</span> <span class="toc-text">非线性数据结构</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%A0%91-Tree"><span class="toc-number">1.2.1.</span> <span class="toc-text">树(Tree)</span></a><ol class="toc-child"><li class="toc-item toc-level-4"><a class="toc-link" href="#%E4%BA%8C%E5%8F%89%E6%A0%91-Binary-Tree"><span class="toc-number">1.2.1.1.</span> <span class="toc-text">二叉树(Binary Tree)</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91-BST"><span class="toc-number">1.2.1.2.</span> <span class="toc-text">二叉搜索树(BST)</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91-AVL-Tree"><span class="toc-number">1.2.1.3.</span> <span class="toc-text">平衡二叉树(AVL Tree)</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E7%BA%A2%E9%BB%91%E6%A0%91-Red-Black-Tree"><span class="toc-number">1.2.1.4.</span> <span class="toc-text">红黑树(Red-Black Tree)</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E5%AD%97%E5%85%B8%E6%A0%91-Trie"><span class="toc-number">1.2.1.5.</span> <span class="toc-text">字典树(Trie)</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E5%93%88%E5%A4%AB%E6%9B%BC%E6%A0%91-Huffman-Tree"><span class="toc-number">1.2.1.6.</span> <span class="toc-text">哈夫曼树(Huffman Tree)</span></a></li></ol></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%9B%BE-Graph"><span class="toc-number">1.2.2.</span> <span class="toc-text">图(Graph)</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%A0%86-Heap"><span class="toc-number">1.2.3.</span> <span class="toc-text">堆(Heap)</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%93%88%E5%B8%8C%E8%A1%A8-Hash-Table"><span class="toc-number">1.2.4.</span> <span class="toc-text">哈希表(Hash Table)</span></a></li></ol></li></ol></li></ol></div></div><div class="card-widget card-recent-post"><div class="item-headline"><i class="fas fa-history"></i><span>Recent Posts</span></div><div class="aside-list"><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2025/03/20/%E5%A6%82%E4%BD%95%E6%9B%B4%E6%96%B0GitHub%E5%8D%9A%E5%AE%A2/" title="如何更新GitHub博客">如何更新GitHub博客</a><time datetime="2025-03-20T04:00:00.000Z" title="Created 2025-03-20 12:00:00">2025-03-20</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2025/03/15/Java%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%AE%9E%E7%8E%B0%E8%AF%A6%E8%A7%A3/" title="Java数据结构实现详解">Java数据结构实现详解</a><time datetime="2025-03-15T06:30:00.000Z" title="Created 2025-03-15 14:30:00">2025-03-15</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E9%83%A8%E5%88%86/" title="数据结构部分">数据结构部分</a><time datetime="2025-03-09T19:14:13.000Z" title="Created 2025-03-10 03:14:13">2025-03-10</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2025/03/10/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%BC%96%E7%A8%8B/" title="数据结构与编程">数据结构与编程</a><time datetime="2025-03-09T17:54:01.000Z" title="Created 2025-03-10 01:54:01">2025-03-10</time></div></div><div class="aside-list-item no-cover"><div class="content"><a class="title" href="/2025/03/10/hello-world/" title="Hello World">Hello World</a><time datetime="2025-03-09T16:00:44.919Z" title="Created 2025-03-10 00:00:44">2025-03-10</time></div></div></div></div></div></div></main><footer id="footer"><div id="footer-wrap"><div class="copyright">&copy;2019 - 2025 By CanJisam</div><div class="framework-info"><span>Framework </span><a target="_blank" rel="noopener" href="https://hexo.io">Hexo 7.3.0</a><span class="footer-separator">|</span><span>Theme </span><a target="_blank" rel="noopener" href="https://github.com/jerryc127/hexo-theme-butterfly">Butterfly 5.3.5</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="readmode" type="button" title="Reading Mode"><i class="fas fa-book-open"></i></button><button id="darkmode" type="button" title="Toggle Between Light and Dark Mode"><i class="fas fa-adjust"></i></button><button id="hide-aside-btn" type="button" title="Toggle Between Single-column and Double-column"><i class="fas fa-arrows-alt-h"></i></button></div><div id="rightside-config-show"><button id="rightside-config" type="button" title="Settings"><i class="fas fa-cog fa-spin"></i></button><button class="close" id="mobile-toc-button" type="button" title="Table of Contents"><i class="fas fa-list-ul"></i></button><button id="go-up" type="button" title="Back to Top"><span class="scroll-percent"></span><i class="fas fa-arrow-up"></i></button></div></div><div><script src="/js/utils.js"></script><script src="/js/main.js"></script><div class="js-pjax"></div><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script></div></body></html>